Task #0999

Memory 20 MB Time 1000 ms Complexity 35 %

#Dinamik dasturlash

Sub array

Bugun bir masalaga ko`zim tushub qoldi endi bu masalani siz bilan bo`lishmoqchiman.
Masala sharti quydagicha: Sizga \(n\) ta elementldan iborat \(\text{arr[]}\) massiv berilgan. Yig'indisi 0 ga teng bo'lgan subarray (quyi massiv)larning sonini toping

Input:

Birinchi qatora N soni ya'ni massiv elementlar soni \((1 \le N \le 10^5 )\)
Ikkinchi qatorda esa massiv elementlari \(( -10^9 \le arr[i] \le 10^9 )\)

Output:

Chiqish faylining yagona satrida yig`indisi nolga teng bo`lgan sub arraylarning sonini chop eting

Examples

#	input.txt	output.txt
1	6 0 0 5 5 0 0	6
2	10 6 -1 -3 4 -2 2 4 6 -12 -7	4

Telegram Facebook

Submit answer

Please, sing in, to complete this action, if you don't have account, you can sign up any moment